analysis of the relation of search method both inside a block and between blocks and its asymptotic time complexity gives a better block-divided method which makes the index search have the minimum asymptotic time complexity 摘要分析索引查找算法中塊內(nèi)、塊間查找方法的選擇與時(shí)間復(fù)雜的關(guān)系,給出具有最小漸近時(shí)間復(fù)雜度的最佳分塊方法。
analysis of the relation of search method both inside a block and between blocks and its asymptotic time complexity gives a better block-divided method which makes the index search have the minimum asymptotic time complexity 摘要分析索引查找算法中塊內(nèi)、塊間查找方法的選擇與時(shí)間復(fù)雜的關(guān)系,給出具有最小漸近時(shí)間復(fù)雜度的最佳分塊方法。